Another important problem in multiple - valued logic completeness theory is decision for sheffer functions , which reduced to determining the minimal covering of precomplete classes in multiple - valued logic 多值邏輯完備性理論中的另一重要問題是sheffer函數(shù)的判定問題,此問題可歸結(jié)為定出所有極大封閉集(準(zhǔn)完備集)的最小覆蓋。
Followed the proving of validness of axioms is the proving of soundness and consistency for the negotiation logic . based on a series of propositions and lemmas , the completeness of the negotiation logic is proved by construction . then the logic completeness and the consistency of ctn system are presented 在對公理的有效性進(jìn)行證明之后,證明了協(xié)商推理邏輯的可靠性和無矛盾性;在得出的一系列命題和引理基礎(chǔ)上,以構(gòu)造的方法證明了協(xié)商推理邏輯的完全性,最后得出協(xié)商推理邏輯的完備性和整個(gè)ctn系統(tǒng)的無矛盾性。